649 research outputs found

    A family of pseudo-Anosov braids with large conjugacy invariant sets

    Full text link
    We show that there is a family of pseudo-Anosov braids independently parameterized by the braid index and the (canonical) length whose smallest conjugacy invariant sets grow exponentially in the braid index and linearly in the length and conclude that the conjugacy problem remains exponential in the braid index under the current knowledge.Comment: 16 pages, 6 figure

    Grid diagram for singular links

    Full text link
    In this paper, we define the set of singular grid diagrams SG\mathcal{SG} which provides a unified description for singular links, singular Legendrian links, singular transverse links, and singular braids. We also classify the complete set of all equivalence relations on SG\mathcal{SG} which induce the bijection onto each singular object. This is an extension of the known result of Ng-Thurston for non-singular links and braids.Comment: 33 pages, 34 figure

    Legendrian singular links and singular connected sums

    Full text link
    We study Legendrian singular links up to contact isotopy. Using a special property of the singular points, we define the singular connected sum of Legendrian singular links. This concept is a generalization of the connected sum and can be interpreted as a tangle replacement, which provides a way to classify Legendrian singular links. Moreover, we investigate several phenomena only occur in the Legendrian setup

    Subdivisional spaces and graph braid groups

    Get PDF
    We study the problem of computing the homology of the configuration spaces of a finite cell complex XX. We proceed by viewing XX, together with its subdivisions, as a subdivisional space--a kind of diagram object in a category of cell complexes. After developing a version of Morse theory for subdivisional spaces, we decompose XX and show that the homology of the configuration spaces of XX is computed by the derived tensor product of the Morse complexes of the pieces of the decomposition, an analogue of the monoidal excision property of factorization homology. Applying this theory to the configuration spaces of a graph, we recover a cellular chain model due to \'{S}wi\k{a}tkowski. Our method of deriving this model enhances it with various convenient functorialities, exact sequences, and module structures, which we exploit in numerous computations, old and new.Comment: 71 pages, 15 figures. Typo fixed. May differ slightly from version published in Documenta Mathematic
    corecore